Topological Bounds for Graph Representations over Any Field

نویسندگان

چکیده

Haviv [European J. Combin., 81 (2019), pp. 84--97] has recently proved that some topological lower bounds on the chromatic number of graphs are also their orthogonality dimension ov...

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological Colouring Bounds and Graph Structure

Lovász invoked topological colouring bounds in proving Kneser’s Conjecture. Subsequently, numerous applications of topological techniques to graph colouring problems have arisen. However, even today, little is known about how to construct a graph with a particular topological colouring bound, or about the structure of such graphs. The aim of this thesis is to remedy this deficit. First, we will...

متن کامل

Bounds for the Co-PI index of a graph

In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.

متن کامل

Topological graph polynomials and quantum field theory

We define a new topological polynomial extending the Bollobás-Riordan one, which obeys a four-term reduction relation of the deletion/contraction type and has a natural behavior under partial duality. This allows to write down a completely explicit combinatorial evaluation of the polynomials, occurring in the parametric representation of the non-commutative Grosse-Wulkenhaar quantum field theor...

متن کامل

Distance-Based Topological Indices and Double graph

Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

متن کامل

bounds for the co-pi index of a graph

in this paper, we present some inequalities for the co-pi index involving the some topological indices, the number of vertices and edges, and the maximum degree. after that, we give a result for trees. in addition, we give some inequalities for the largest eigenvalue of the co-pi matrix of g.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2021

ISSN: ['1095-7146', '0895-4801']

DOI: https://doi.org/10.1137/19m1295921